A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree
نویسندگان
چکیده
منابع مشابه
A Minimal Rk-degree
We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it.
متن کاملA weakly-2-generic which bounds a minimal degree
Jockusch showed that 2-generic degrees are downward dense below a 2-generic degree, but in the case of 1-generic degrees Kumabe, and independently Chong and Downey constructed a minimal degree computable from a 1-generic degree. We explore the tightness of these results. We solve a question of Barmpalias and Lewis-Pye by constructing a minimal degree computable from a weakly 2-generic one. The ...
متن کاملForcing Minimal Degree of Constructibility
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملA Fixed Point Free Minimal Degree
We show that there exists a Turing degree which is minimal and fixed point free.
متن کاملA Random Degree with Strong Minimal Cover
We show that there exists a Martin-Löf random degree which has a strong minimal cover.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2010
ISSN: 0029-4527
DOI: 10.1215/00294527-2010-028